A preemptive priority queue with a general bulk service rule
نویسندگان
چکیده
منابع مشابه
A Finite Capacity Priority Queue with Discouragement
In this paper we report on a study of a two level preemptive priority queue with balking and reneging for lower priority level. The inter-arrival and the service times for both levels follow exponential distribution. We use a finite difference equation approach for solving the balance equations of the governing queuing model whose states are described by functions of one independent variable. H...
متن کاملA Preemptive Priority Queue as a Model with Server Vacations
We derive the performance measures for non-priority customers in a priority single-server queue with two types of Markovian arrival processes (MAPs). One type of customers has preemptive resume (or repeat) priority over the other. We regard the model with two types of MAP arrivals as an MAP/SM/l queue with only non-priority customers arrivals, semi-Markovian service times and some server vacati...
متن کاملA Preemptive Priority Queue with Accessible Batch Service and Heterogeneous Arrivals and with Vacation
In this paper a single server preemptive priority queuing system consisting of two types of customer units with Poisson arrival, exponential service time distribution and exponential vacation is analyzed. Two type of customer units of which higher priority units of unlimited Poisson input are served by bulk service rule and limited Poisson input of low priority units served singly. The bulk ser...
متن کاملA preemptive repeat priority queue with resampling: Performance analysis
In this paper, we analyze a discrete-time preemptive repeat priority queue with resampling. High-priority packets have preemptive repeat priority, and interrupted low-priority packets are subjected to independent retransmission attempts. Both classes contain packets with generally distributed transmission times. We show that the use of generating functions is beneficial for analyzing the system...
متن کاملNotes on ‘ Performance Analysis Of The System Contents In A Discrete - time non - preemptive Priority Queue With General Service Times
2. The server is busy serving a class 2 packet during slot k. This can only be the case if at the beginning of the last “start slot” (this is start slot l, in which the service of the currently served packet started) there were no class 1 packets in the system. Otherwise, a class 1 packet would have gone into service at that time instead of a class 2 packet, because of the priority scheduling. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the Australian Mathematical Society
سال: 1986
ISSN: 0004-9727,1755-1633
DOI: 10.1017/s0004972700003105